New parallel optimal-parameter fast multipole method (OPFMM)

نویسندگان

  • Cheol Ho Choi
  • Klaus Ruedenberg
  • Mark S. Gordon
چکیده

The three key translation equations of the fast multipole method (FMM) are deduced from the general polypolar expansions given earlier. Simplifications are introduced for the rotation-based FMM that lead to a very compact FMM formalism. The optimum-parameter searching procedure, a stable and efficient way of obtaining the optimum set of FMM parameters, is established with complete control over the tolerable error (ε). This new procedure optimizes the linear scaling with respect to the number of particles for a given ε. In addition, a new parallel FMM algorithm, which requires virtually no internode communication, is suggested that is suitable for the parallel construction of Fock matrices in electronic structure calculations. © 2001 John Wiley & Sons, Inc. J Comput Chem 22: 1484–1501, 2001

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Provably Optimal, Distribution-Independent Parallel Fast Multipole Method

The Fast Multipole Method (FMM) is a robust technique for the rapid evaluation of the combined e ect of pairwise interactions of n data sources. Parallel computation of the FMM is considered a challenging problem due to the dependence of the computation on the distribution of the data sources, usually resulting in dynamic data decomposition and load balancing problems. In this paper, we present...

متن کامل

A Parallel Shared Memory Implementation of the Fast Multipole Method for Electromagnetics

An implementation of the multilevel Fast Multipole method for time harmonic electromagnetic computations is presented. The method is parallelized for shared memory machines. A new parallelization scheme which is a hybrid between previous methods is proposed. Several symmetries and other methods that reduce the storage requirement are proposed. The most important symmetry is for the translation ...

متن کامل

Parallel Fast Multipole Algorithm using MPI

The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is O(N 2), where N is the number of particles in the system. The fast multipole algo...

متن کامل

Performance Evaluation of the Parallel Fast Multipole Algorithm Using the Optimal Effectiveness Metric

Scalability measurements of parallel applications are of signiicant interest to the evaluation and characterization of various parallel algorithms, particularly in scientiic computing. Previously, several metrics have been proposed and accepted by the community of researchers in parallel algorithm development. However, none of these have all the attributes required by an eeective metric for par...

متن کامل

Adaptation and Performance of the Cartesian Coordinates Fast Multipole Method for Nanomagnetic Simulations

An implementation of the fast multiple method (FMM) is performed for magnetic systems with long-ranged dipolar interactions. Expansion in spherical harmonics of the original FMM is replaced by expansion of polynomials in cartesian coordinates, which is considerably simpler. Under open boundary conditions, an expression for multipole moments of point dipoles in a cell is derived. These make the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Computational Chemistry

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2001